const runtime.ptrBits
210 uses
runtime (current package)
arena.go#L560: for i := uintptr(0); i < nb; i += ptrBits {
arena.go#L562: if k > ptrBits {
arena.go#L563: k = ptrBits
arena.go#L606: h.low = offset / goarch.PtrSize % ptrBits
arena.go#L621: if h.valid+valid <= ptrBits {
arena.go#L631: h.mask = bits >> (ptrBits - h.valid) // leftover for next word
arena.go#L632: h.valid += valid - ptrBits // have h.valid+valid bits, writing ptrBits of them
arena.go#L635: idx := h.offset / (ptrBits * goarch.PtrSize)
arena.go#L645: h.offset += ptrBits * goarch.PtrSize
arena.go#L656: for words > ptrBits {
arena.go#L657: h = h.write(s, 0, ptrBits)
arena.go#L658: words -= ptrBits
arena.go#L675: z := ptrBits - h.valid
arena.go#L685: idx := h.offset / (ptrBits * goarch.PtrSize)
arena.go#L698: h.offset += ptrBits * goarch.PtrSize
arena.go#L707: idx := h.offset / (ptrBits * goarch.PtrSize)
arena.go#L708: if zeros < ptrBits {
arena.go#L711: } else if zeros == ptrBits {
arena.go#L716: zeros -= ptrBits
arena.go#L718: h.offset += ptrBits * goarch.PtrSize
malloc_generated.go#L105: i := o / ptrBits
malloc_generated.go#L106: j := o % ptrBits
malloc_generated.go#L110: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L112: bits0 := ptrBits - j
malloc_generated.go#L121: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L270: i := o / ptrBits
malloc_generated.go#L271: j := o % ptrBits
malloc_generated.go#L275: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L277: bits0 := ptrBits - j
malloc_generated.go#L286: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L435: i := o / ptrBits
malloc_generated.go#L436: j := o % ptrBits
malloc_generated.go#L440: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L442: bits0 := ptrBits - j
malloc_generated.go#L451: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L600: i := o / ptrBits
malloc_generated.go#L601: j := o % ptrBits
malloc_generated.go#L605: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L607: bits0 := ptrBits - j
malloc_generated.go#L616: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L765: i := o / ptrBits
malloc_generated.go#L766: j := o % ptrBits
malloc_generated.go#L770: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L772: bits0 := ptrBits - j
malloc_generated.go#L781: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L930: i := o / ptrBits
malloc_generated.go#L931: j := o % ptrBits
malloc_generated.go#L935: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L937: bits0 := ptrBits - j
malloc_generated.go#L946: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L1095: i := o / ptrBits
malloc_generated.go#L1096: j := o % ptrBits
malloc_generated.go#L1100: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L1102: bits0 := ptrBits - j
malloc_generated.go#L1111: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L1260: i := o / ptrBits
malloc_generated.go#L1261: j := o % ptrBits
malloc_generated.go#L1265: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L1267: bits0 := ptrBits - j
malloc_generated.go#L1276: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L1425: i := o / ptrBits
malloc_generated.go#L1426: j := o % ptrBits
malloc_generated.go#L1430: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L1432: bits0 := ptrBits - j
malloc_generated.go#L1441: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L1590: i := o / ptrBits
malloc_generated.go#L1591: j := o % ptrBits
malloc_generated.go#L1595: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L1597: bits0 := ptrBits - j
malloc_generated.go#L1606: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L1755: i := o / ptrBits
malloc_generated.go#L1756: j := o % ptrBits
malloc_generated.go#L1760: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L1762: bits0 := ptrBits - j
malloc_generated.go#L1771: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L1920: i := o / ptrBits
malloc_generated.go#L1921: j := o % ptrBits
malloc_generated.go#L1925: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L1927: bits0 := ptrBits - j
malloc_generated.go#L1936: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L2085: i := o / ptrBits
malloc_generated.go#L2086: j := o % ptrBits
malloc_generated.go#L2090: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L2092: bits0 := ptrBits - j
malloc_generated.go#L2101: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L2250: i := o / ptrBits
malloc_generated.go#L2251: j := o % ptrBits
malloc_generated.go#L2255: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L2257: bits0 := ptrBits - j
malloc_generated.go#L2266: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L2415: i := o / ptrBits
malloc_generated.go#L2416: j := o % ptrBits
malloc_generated.go#L2420: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L2422: bits0 := ptrBits - j
malloc_generated.go#L2431: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L2580: i := o / ptrBits
malloc_generated.go#L2581: j := o % ptrBits
malloc_generated.go#L2585: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L2587: bits0 := ptrBits - j
malloc_generated.go#L2596: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L2745: i := o / ptrBits
malloc_generated.go#L2746: j := o % ptrBits
malloc_generated.go#L2750: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L2752: bits0 := ptrBits - j
malloc_generated.go#L2761: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L2910: i := o / ptrBits
malloc_generated.go#L2911: j := o % ptrBits
malloc_generated.go#L2915: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L2917: bits0 := ptrBits - j
malloc_generated.go#L2926: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L3075: i := o / ptrBits
malloc_generated.go#L3076: j := o % ptrBits
malloc_generated.go#L3080: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L3082: bits0 := ptrBits - j
malloc_generated.go#L3091: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L3240: i := o / ptrBits
malloc_generated.go#L3241: j := o % ptrBits
malloc_generated.go#L3245: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L3247: bits0 := ptrBits - j
malloc_generated.go#L3256: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L3405: i := o / ptrBits
malloc_generated.go#L3406: j := o % ptrBits
malloc_generated.go#L3410: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L3412: bits0 := ptrBits - j
malloc_generated.go#L3421: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L3570: i := o / ptrBits
malloc_generated.go#L3571: j := o % ptrBits
malloc_generated.go#L3575: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L3577: bits0 := ptrBits - j
malloc_generated.go#L3586: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L3735: i := o / ptrBits
malloc_generated.go#L3736: j := o % ptrBits
malloc_generated.go#L3740: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L3742: bits0 := ptrBits - j
malloc_generated.go#L3751: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L3900: i := o / ptrBits
malloc_generated.go#L3901: j := o % ptrBits
malloc_generated.go#L3905: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L3907: bits0 := ptrBits - j
malloc_generated.go#L3916: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L4065: i := o / ptrBits
malloc_generated.go#L4066: j := o % ptrBits
malloc_generated.go#L4070: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L4072: bits0 := ptrBits - j
malloc_generated.go#L4081: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L4230: i := o / ptrBits
malloc_generated.go#L4231: j := o % ptrBits
malloc_generated.go#L4235: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L4237: bits0 := ptrBits - j
malloc_generated.go#L4246: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_stubs.go#L597: i := o / ptrBits
malloc_stubs.go#L598: j := o % ptrBits
malloc_stubs.go#L609: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_stubs.go#L611: bits0 := ptrBits - j
malloc_stubs.go#L620: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j) // We're taking the min so this compiles on 32 bit platforms. But if bits > ptrbits we always take the other branch
mbitmap.go#L226: tp.mask ^= uintptr(1) << (i & (ptrBits - 1))
mbitmap.go#L255: if tp.addr+goarch.PtrSize*ptrBits >= tp.elem+tp.typ.PtrBytes {
mbitmap.go#L259: tp.addr += ptrBits * goarch.PtrSize
mbitmap.go#L269: if tp.addr+goarch.PtrSize*ptrBits > limit {
mbitmap.go#L270: bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize
mbitmap.go#L271: tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits)
mbitmap.go#L294: if tp.addr+goarch.PtrSize*ptrBits > limit {
mbitmap.go#L295: bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize
mbitmap.go#L296: tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits)
mbitmap.go#L308: tp.addr = tp.elem + alignDown(n-(tp.elem-oldelem), ptrBits*goarch.PtrSize)
mbitmap.go#L310: tp.addr += alignDown(n, ptrBits*goarch.PtrSize)
mbitmap.go#L330: if tp.addr+goarch.PtrSize*ptrBits > limit {
mbitmap.go#L331: bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize
mbitmap.go#L332: tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits)
mbitmap.go#L597: i := (addr - span.base()) / goarch.PtrSize / ptrBits
mbitmap.go#L598: j := (addr - span.base()) / goarch.PtrSize % ptrBits
mbitmap.go#L604: if j+bits > ptrBits {
mbitmap.go#L606: bits0 := ptrBits - j
mbitmap.go#L656: i := o / ptrBits
mbitmap.go#L657: j := o % ptrBits
mbitmap.go#L659: if j+bits > ptrBits {
mbitmap.go#L661: bits0 := ptrBits - j
mbitmap.go#L1014: for i := uintptr(0); i < ptrBits; i++ {
mbitmap.go#L1406: const ptrBits = 8 * goarch.PtrSize
mgcmark_greenteagc.go#L1072: i := (addr - spanBase) / goarch.PtrSize / ptrBits
mgcmark_greenteagc.go#L1073: j := (addr - spanBase) / goarch.PtrSize % ptrBits
mgcmark_greenteagc.go#L1079: if j+bits > ptrBits {
mgcmark_greenteagc.go#L1081: bits0 := ptrBits - j
 |
The pages are generated with Golds v0.8.4. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds. |